Performance Analysis of Cell and Packet Switch with Finite Input Queues and Ilpf Scheduling Algorithm

In this paper, packet loss probability performance in cell-based and packet-based switches with finite Input Queues (IQ) and iLPF scheduling algorithm are analysed. This algorithm has been proposed as a practical scheduling algorithm to achieve 100% throughput in cell-based switches. The scheduling algorithm is implemented in three cases: cellbased (CB-iLPF) switching, packet-based (PB-iLPF) switching and “waiting” packet-based (WPB-iLPF) switching. We investigate possible performance penalties dealing with variablesize data units and packet-based scheduling algorithms. We made performance comparison of considered IQ switches under input bursty traffics scenario. It is shown that WPB-iLPF switch performances are very sensitive to “waiting” period duration and that for input load smaller than 0.75, cell-based crossbar switch introduces packet loss probability greater than introduced by the packet-based switches. Keywordscell-based switching, packet-based switching, inputqueued switch, virtual output queueing, average packet delay, average input buffer size.